VI Conferencia de la Asociación Española para la Inteligencia Artificial - CAEPIA 1995, Alicante (Spain). 15-17 November 1995
Summary:
This paper present two new algorithms for top-down induction of decision trees (TDIDT), (extensions of some previously existing procedures), based on using background knowledge not present in the learning set. Typically, in the different domain applications of the machine learning techniques there exists some knowledge, more or less accurate, about the relationships between attributes and classes. The algorithms presented make use of this additional information, (usually obtained from experts), allowing a better control of the learning process. As result of this, more understandable trees may be obtained, with better generalization capability. The application of handwritten digits is presented. A review of the main TDIDT algorithms is included.
Keywords: aprendizaje automático, árboles de decisión, conocimiento dependiente del dominio de aplicación, reconocimiento de caracteres
Published in VI Conferencia de la Asociación Española para la Inteligencia Artificial CAEPIA 95, pp: 235-246, ISBN: 84-920982-0-1
Publication date: 1995-11-17.
Citation:
E.F. Sánchez-Úbeda, J. Alba, ., VI Conferencia de la Asociación Española para la Inteligencia Artificial - CAEPIA 1995, Alicante (Spain). 15-17 November 1995. In: VI Conferencia de la Asociación Española para la Inteligencia Artificial CAEPIA 95: Libro de actas, ISBN: 84-920982-0-1
